Partial Constraint Satisfaction
نویسنده
چکیده
A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and studying such partial constraint satisfaction problems. The basic components of this model are a constraint satisfaction problem, a problem space, and a metric on that space. Algorithms for solving partial constraint satisfaction problems are discussed. A specific branch and bound algorithm is described. Some initial experimental experience with this algorithm is presented.
منابع مشابه
An algorithm for solving constraint-satisfaction problems
We introduce a new method, called constraint-directed-generate-and-test (CDGT), for solving constraint satisfaction problems (CSPs). Instead of appending a new instantiation of one variable to a partial solution, as in traditional search methods, CDGT joins two sets of partial solutions and then checks against other relevant constraints to obtain a set of higher order partial solutions. CDGT is...
متن کاملDynamic camera allocation method based on constraint satisfaction and cooperative search
In this paper, the dynamic allocation of camera resources for moving objects is presented as a model of partial constraint satisfaction problem. The purpose of the camera allocation is described as some simple constraint. The solution is reflexively searched in order to decide the allocation of each camera. The search neighborhood of the solution is limited to the partial solution for each came...
متن کاملFinding Regions for Local Repair in Partial Constraint Satisfaction
Yet, two classes of algorithms have been used in partial constraint satisfaction: local search methods and branch&bound search extended by the classical constraint-processing techniques like e.g. forward checking and backmarking. Both classes exhibit characteristic advantages and drawbacks. This article presents a novel approach for solving partial constraint satisfaction problems exhaustively ...
متن کاملCompletable Partial Solutions in Constraint Programming and Constraint-Based Scheduling
The paper introduces the notion of freely completable partial solutions to characterize constraint satisfaction problems that have components which are relatively easy to solve and are only loosely connected to the remaining parts of the problem. Discovering such partial solutions during the solution process can result in strongly pruned search trees. We give a general definition of freely comp...
متن کاملComplexity of K-Tree Structured Constraint Satisfaction Problems
Trees have played a key role in the study of constraint satisfaction problems because problems with tree structure can be solved efficiently. It is shown here that a family of generalized trees, k-trees, can offer increasing representational complexity for constraint satisfaction problems, while maintaining a bound on computational complexity linear in the number of variables and exponential in...
متن کامل